Gomory integer programs
نویسندگان
چکیده
The set of all group relaxations of an integer program contains certain special members called Gomory relaxations. A family of integer programs with a fixed coefficient matrix and cost vector but varying right hand sides is a Gomory family if every program in the family can be solved by one of its Gomory relaxations. In this paper, we characterize Gomory families. Every TDI system gives a Gomory family, and we construct Gomory families from matrices whose columns form a Hilbert basis for the cone they generate. The existence of Gomory families is related to the Hilbert covering problems that arose from the conjectures of Sebö. Connections to commutative algebra are outlined at the end.
منابع مشابه
The Ongoing Story of Gomory Cuts
The story of Gomory cuts is characterized by swings between great acclaim in the early days, near oblivion for decades and an amazing come back in the last 20 years. These cuts have been described as “elegant”, “disappointing” and “the clear winner” at various times over the last 55 years. This essay retraces that roller coaster. Ralph Gomory’s paper “Early Integer Programming” recounts his dis...
متن کاملFinitely Convergent Decomposition Algorithms for Two-Stage Stochastic Pure Integer Programs
We study a class of two-stage stochastic integer programs with general integer variables in both stages and finitely many realizations of the uncertain parameters. Based on Benders’ method, we propose a decomposition algorithm that utilizes Gomory cuts in both stages. The Gomory cuts for the second-stage scenario subproblems are parameterized by the first-stage decision variables, i.e., they ar...
متن کاملStrengthening Gomory Mixed-Integer Cuts: A Computational Study
Gomory mixed-integer cuts are an important ingredient in state-ofthe-art software for solving mixed-integer linear programs. In particular, much attention has been paid to the strengthening of these cuts. In this paper, we give an overview of existing approaches for improving the performance of Gomory mixed-integer cuts. More precisely, we consider k-cuts, combined Gomory mixed-integer cuts, re...
متن کاملOn the knapsack closure of 0-1 Integer Linear Programs
Many inequalities for Mixed-Integer Linear Programs (MILPs) or pure Integer Linear Programs (ILPs) are derived from the Gomory corner relaxation, where all the nonbinding constraints at an optimal LP vertex are relaxed. Computational results show that the corner relaxation gives a good approximation of the integer hull for problems with general-integer variables, but the approximation is less s...
متن کاملValid inequalities based on the interpolation procedure
We study the interpolation procedure of Gomory and Johnson (1972), which generates cutting planes for general integer programs from facets of cyclic group polyhedra. This idea has recently been re-considered by Evans (2002) and Gomory, Johnson and Evans (2003). We compare inequalities generated by this procedure with mixed-integer rounding (MIR) based inequalities discussed in Dash and Gunluk (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Program.
دوره 96 شماره
صفحات -
تاریخ انتشار 2003